A Provable Secure ID-Based Explicit Authenticated Key Agreement Protocol Without Random Oracles
نویسندگان
چکیده
منابع مشابه
Revocable Attribute-based Key Agreement Protocol without Random Oracles
In this paper, we present a two-party attributebased key agreement protocol, which is secure in the standard model (without random oracles), under the truncated decision q-ABDHE assumption. Then we give a modified version of this scheme, in which the users can be revoked efficiently. The attribute-based key agreement protocol is based on the attribute-based encryption scheme, which is a general...
متن کاملA New Efficient ID-Based Authenticated Key Agreement Protocol
Recently Eun-Kyung Ryu, Eun-Jun Yoon, and Kee-Young Yoo proposed an efficient ID-based authenticated key agreement with paring[11]. They argued that it is secure and efficient. In this paper, we show this protocol is doesn’t satisfy the Key-Compromise Impersonate property and it is not secure against key reveal attack. Then we propose our protocol from this protocol and shim’s protocol[15], its...
متن کاملA New Efficient Authenticated ID-Based Group Key Agreement Protocol
Group key agreement (GKA) protocols Play a main role in constructing secure multicast channels. These protocols are algorithms that describe how a group of parties communicating over a public network can gain a common secret key. ID-based authenticated group key agreement (AGKA) cryptosystems based on bilinear pairings are update researching subject because of the simplicity of their public key...
متن کاملAn Efficient ID-Based Authenticated Key Agreement Protocol with Pairings
In this paper, we describe a new ID-based authenticated key agreement protocol that makes use of bilinear pairings. We then discuss the security properties of our scheme, including known-key security, perfect forward secrecy and no key control. It is also able to withstand both passive and active attacks. An important advantage of our scheme is that it preserves the perfect forward secrecy even...
متن کاملIEEE 1363.3 Submission: Implicitly Authenticated ID-Based Key Agreement Protocol
In this submission, we propose an efficient identity-based and implicitly authenticated key agreement protocol IDAK based on pairing techniques. Though both Weil and Tate pairing could be used for IDAK, we recommend Tate pairing for IDAK to avoid extra ephemeral value validation process. The security of IDAK was formally proved in [22] in Bellare-Rogaway model with random oracle. In additon, ID...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Technology
سال: 2008
ISSN: 1000-9000,1860-4749
DOI: 10.1007/s11390-008-9178-z